Computational geometry - PDFSEARCH.IO - Document Search Engine

Computational geometry
Results: 1031

#	Item
321	The Visibility Region of Points in a Simple Polygon Otfried Cheong Ren´e van Oostrum Hong Kong University of Science and Technology Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:02:14 Polytopes Art gallery problem Computational geometry Simple polygon Polyhedra Complex polytope Path decomposition Geometry Mathematics Polygons
322	CCCG 2006, Kingston, Ontario, August 14–16, 2006 On Approximate Range Searching – or – Get in Shape; Round is a Good Choice David M. Mount Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:58:52 Semigroup Computational geometry Complexity Science Structure Ethology Database theory Range searching Algebraic structures
323	CCCG 2011, Toronto ON, August 10–12, 2011 Convexifying Polygons Without Losing Visibilities Oswin Aichholzer∗ Ferran Hurtado¶ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Polygons Euclidean plane geometry 3D computer graphics Triangulation Computational geometry Vertex Pseudotriangle Simple polygon Polyhedron Geometry Graph theory Mathematics
324	DasNic_trs_printed_v4.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Database theory Range searching Computational geometry Logarithm Triangle Interval tree K-d tree Geometry Mathematics Elementary mathematics
325	CCCG 2009, Vancouver, BC, August 17–19, 2009 Every Large Point Set contains Many Collinear Points or an Empty Pentagon Zachary Abel∗ Ferran Hurtadok Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:32:39 Convex analysis Convex geometry Euclidean plane geometry Discrete geometry Computational geometry Convex hull Convex set Sylvester–Gallai theorem Convex function Geometry Mathematics Mathematical optimization
326	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Tight Bounds for Point Recolouring Yurai N´ un ˜ez and David Rappaport Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:44 Euclidean plane geometry Convex geometry Triangulation Computational geometry Convex hull Polygon Convex set Pitteway triangulation Monotone polygon Geometry Mathematics Convex analysis
327	16th Canadian Conference on Computational Geometry, 2004 Smallest point enclosing rectangle of arbitrary orientation Sandip Das Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Area Bin Diacritic Latin-derived alphabet Geometry Quadrilaterals Rectangle
328	Spatial Organization and Correlations of Cell Nuclei in Brain Tumors Yang Jiao1, Hal Berman2, Tim-Rasmus Kiehl3, Salvatore Torquato4* 1 Physical Science in Oncology Center, Princeton Institute for the Science and Technol Add to Reading List Source URL: cherrypit.princeton.edu Language: English - Date: 2011-11-18 21:37:04 Biology Computational geometry Diagrams Discrete geometry Voronoi diagram Glioma Poisson distribution Stress Atomic nucleus Brain tumor Chemistry Physics
329	Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The Add to Reading List Source URL: www98.griffith.edu.au Language: English - Date: 2011-05-11 13:37:50 Packaging Operations research Discrete geometry Bin packing problem Mathematical optimization Computational complexity theory Packing problem Carton Bounded-error probabilistic polynomial Theoretical computer science Mathematics Applied mathematics
330	CCCG 2011, Toronto ON, August 10–12, 2011 Robust approximate assembly partitioning Elisha Sacks∗ Victor Milenkovic† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Analysis of algorithms Computational complexity theory Convex geometry Digital geometry Minkowski addition Algorithm Time complexity Mathematics Theoretical computer science Geometry

UPDATE